Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
نویسندگان
چکیده
منابع مشابه
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively over the past decade. In contrast, in this paper we aim at an understanding of the fundamental algorithmic limitations on what a set of autonomous mobile robots can or cannot achieve. We therefore study a hard task for ...
متن کاملErratum: Pattern Formation by Oblivious Asynchronous Mobile Robots
We make a correction to a pattern formation algorithm FORM for oblivious asynchronous mobile robots in [N. Fujinaga, Y. Yamauchi, H. Ono, S. Kijima, and M. Yamashita, “Pattern formation by oblivious asynchronous mobile robots,” SIAM J. Comput., 44, 3, 740–785, 2015.]
متن کاملOptimal Grid Exploration by Asynchronous Oblivious Robots
We propose optimal (w.r.t. the number of robots) solutions for the deterministic terminating exploration (exploration for short) of a grid-shaped network by a team of k asynchronous oblivious robots in the asynchronous non-atomic model, so-called CORDA. In more details, we first consider the ATOM model. We show that it is impossible to explore a grid of at least three nodes with less than three...
متن کاملSquare Formation by Asynchronous Oblivious Robots
A fundamental problem in Distributed Computing is the Pattern Formation problem, where some independent mobile entities, called robots, have to rearrange themselves in such a way as to form a given figure from every possible (non-degenerate) initial configuration. In the present paper, we consider robots that operate in the Euclidean plane and are dimensionless, anonymous, oblivious, silent, as...
متن کاملCrash tolerant gathering on grid by asynchronous oblivious robots
Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed independently by each robot so that all robots meet at a single node after finite time. The robots operate in Look-Compute-Move cycles. In each cycle, a robot takes a snapshot of the current configuration of the grid in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2020
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2020.02.016